/* =============================================================
 * Your Grandmother's guide to Algorithms
 * =============================================================
 *
 * Copyright (c) 2007, Saverio Miroddi
 *
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without 
 * modification, are permitted provided that the following conditions are met:
 * 
 *     * Redistributions of source code must retain the above copyright notice,
 *       this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright 
 *       notice, this list of conditions and the following disclaimer in the 
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name of the SaverioMiroddiSoftware nor the names of its 
 *       contributors may be used to endorse or promote products derived from 
 *       this software without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 
 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *  
 * ---------------------------
 * GraphUtils.java
 * ---------------------------
 *
 */
package utils;

import java.util.Arrays;
import java.util.List;

import nodes.GraphNode;

/**
 * Utilities for graphs
 * 
 * @author Saverio Miroddi
 */
public class GraphUtils
{
	/**
	 * Return a test graph (a..f).
	 */
	public static List<GraphNode> getTestGraph()
	{
		GraphNode a = new GraphNode('a');
		GraphNode b = new GraphNode('b');
		GraphNode c = new GraphNode('c');
		GraphNode d = new GraphNode('d');
		GraphNode e = new GraphNode('e');
		GraphNode f = new GraphNode('f');

		a.addNode(e, 5);
		a.addNode(f, 12);
		
		b.addNode(a, 15);
		b.addNode(c, 9);
		
		c.addNode(d, 5);
		
		d.addNode(b, 2);
		
		e.addNode(c, 10);
		e.addNode(f, 4);
		
		f.addNode(c, 17);
		f.addNode(d, 20);
		
		return Arrays.asList(a, b, c, d, e, f);
	}
}
